On semi-equivalence of generically-finite polynomial mappings

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial Equivalence of Finite Rings

We prove that Zpn and Zp[t]/(t) are polynomially equivalent if and only if n ≤ 2 or p = 8. For the proof, employing Bernoulli numbers, we provide the polynomials which compute the carry-on part for the addition and multiplication in base p. As a corollary, we characterize finite rings of p elements up to polynomial equivalence.

متن کامل

CCZ and EA equivalence between mappings over finite Abelian groups

CCZand EA-equivalence, which are originally defined for vectorial Boolean functions, are extended to mappings between finite abelian groups G and H. We obtain an extension theorem for CCZequivalent but not EA-equivalent mappings. Recent results in [1] are improved and generalized.

متن کامل

Equivalence in Finite-Variable Logics is Complete for Polynomial Time

How difficult is it to decide whether two finite structures can be distinguished in a given logic? For first order logic, this question is equivalent to the graph isomorphism problem with its well-known complexity theoretic difficulties. Somewhat surprisingly, the situation is much clearer when considering the fragments L of first-order logic whose formulas contain at most variables (for some )...

متن کامل

On Approximating the Entropy of Polynomial Mappings

We investigate the complexity of the following computational problem: POLYNOMIAL ENTROPY APPROXIMATION (PEA): Given a low-degree polynomial mapping p : F → F, where F is a finite field, approximate the output entropy H(p(Un)), where Un is the uniform distribution on F and H may be any of several entropy measures. We show: • Approximating the Shannon entropy of degree 3 polynomials p : F2 → F2 o...

متن کامل

On Projective Equivalence of Univariate Polynomial Subspaces

We pose and solve the equivalence problem for subspaces of Pn, the (n+ 1) dimensional vector space of univariate polynomials of degree ≤ n. The group of interest is SL2 acting by projective transformations on the Grassmannian variety GkPn of k-dimensional subspaces. We establish the equivariance of the Wronski map and use this map to reduce the subspace equivalence problem to the equivalence pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematische Zeitschrift

سال: 2015

ISSN: 0025-5874,1432-1823

DOI: 10.1007/s00209-015-1591-8